EEGFGR: An Energy-Efficient Greedy-Face Geographic Routing for Wireless Sensor Networks

The geographic routing technology is good for the self-organizing and large-scale Wireless Sensor Networks(WSNs), and the energy-limited sensor nodes require the energy used for routing to be minimum. In this paper a new energy-efficient geographic routing algorithm is proposed and it is distributed and based on the geographic routing, the topology characteristics of the network and the wireless communication energy model. The algorithm is based on the planarized graph (GG) of the network, it deals with the routing void by saving more face neighbors in every node, and selects the most energyefficient nexthop node by using the energy-saving technologies including the Minimum Energy One-hop Neighbor Path Selection and the Optimal Faceneighbor Selection. The theoretical analysis and simulations show that the algorithm is feasible and more energy-efficient than many existed geographic routing algorithms. In the end , the means of face information maintenance are proposed.